Computational Complexity of Generalized Forty Thieves

Forty-Four Juvenile Thieves

Computational Complexity of Generalized Golf Solitaire

Computational Complexity of Generalized Push Fight

We analyze the computational complexity of optimally playing the two-player board game Push Fight, generalized to an arbitrary board and number of pieces. We prove that the game is PSPACE-hard to decide who will win from a given position, even for simple (almost rectangular) hole-free boards. We also analyze the mate-in-1 problem: can the player win in a single turn? One turn in Push Fight cons...

On the Computational Complexity of the Domination Game

The domination game is played on an arbitrary graph $G$ by two players, Dominator and Staller. It is known that verifying whether the game domination number of a graph is bounded by a given integer $k$ is PSPACE-complete. On the other hand, it is showed in this paper that the problem can be solved for a graph $G$ in $mathcal O(Delta(G)cdot |V(G)|^k)$ time. In the special case when $k=3$ and the...

Forty-four juvenile thieves revisited: from Bowlby to reactive attachment disorder.

BACKGROUND John Bowlby's work on attachment has had a major influence on practice in child and adolescent psychiatry and developed from observations Bowlby made in his clinical work. In a published case series of work with juvenile offenders, he provided a case description of the differing sets of problems that drove his interest. Clinical features described in a subgroup of these offenders, th...